The Distribution of Irreducible Polynomials in Fq[t]
نویسندگان
چکیده
منابع مشابه
Distribution of irreducible polynomials of small degrees over finite fields
D. Wan very recently proved an asymptotic version of a conjecture of Hansen and Mullen concerning the distribution of irreducible polynomials over finite fields. In this note we prove that the conjecture is true in general by using machine calculation to verify the open cases remaining after Wan’s work. For a prime power q let Fq denote the finite field of order q. Hansen and Mullen in [4, p. 6...
متن کاملA distribution problem for powerfree values of irreducible polynomials
Abstract: To better understand the distribution of gaps between kfree numbers, Erdős posed the problem of establishing an asymptotic formula for the sum of the powers of the lengths of the gaps between k-free numbers. This paper generalizes the problem of Erdős by considering moments of gaps between positive integers m for which f(m) is k-free. Here, f(x) denotes an irreducible polynomial with ...
متن کاملRoots and Irreducible Polynomials
This handout, which accompanies the course on analogies between Z and F [T ], discusses some properties of polynomials in F [T ]. The results in Sections 1 and 2 work with any F , but the results in Section 3 and 4 are (somewhat) special to the field F = Fp. The main result in these notes in Theorem 3.7. The notation F [T ]h(T ), for the ring of polynomials in F [T ] considered modulo h(T ), is...
متن کاملInvariants of Defectless Irreducible Polynomials
Defectless irreducible polynomials over a valued field (F, v) have been studied by means of strict systems of polynomial extensions and complete distinguished chains. Strong connections are developed here between these two approaches and applications made to both. In the tame case where a root α of an irreducible polynomial f generates a tamely ramified extension of (F, v), simple formulas are ...
متن کاملIrreducible Polynomials of Maximum Weight
We establish some necessary conditions for the existence of irreducible polynomials of degree n and weight n over F2. Such polynomials can be used to efficiently implement multiplication in F2n . We also provide a simple proof of a result of Bluher concerning the reducibility of a certain family of polynomials.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1996
ISSN: 0022-314X
DOI: 10.1006/jnth.1996.0139